Decomposing Highly Connected Graphs into Paths of Length Five
نویسنده
چکیده
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. We verify this conjecture for paths of length 5.
منابع مشابه
Decomposing highly edge-connected graphs into paths of any given length
In 2006, Barát and Thomassen posed the following conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . This conjecture was verified for stars, some bistars, paths of length 3, 5, and 2 for every positive integer r. We prove that this conjecture holds for pa...
متن کاملDecomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملDecomposing series-parallel graphs into paths of length 3 and triangles
An old conjecture by Jünger, Reinelt and Pulleyblank states that every 2-edgeconnected planar graph can be decomposed into paths of length 3 and triangles, provided its size is divisible by 3. We prove the conjecture for a class of planar graphs including all 2-edge-connected series-parallel graphs. We also present a 2edge-connected non-planar graph that can be embedded on the torus and admits ...
متن کاملDecompositions of highly connected graphs into paths of length five
We prove that a 171-edge-connected graph has an edgedecomposition into paths of length 3 if and only its size is divisible by 3. It is a long-standing problem whether 2-edge-connectedness is sufficient for planar triangle-free graphs, andwhether 3-edge-connectedness suffices for graphs in general. © 2008 Wiley Periodicals, Inc. J Graph Theory 58: 286–292, 2008 Keyword: path-decompositions
متن کاملDecomposing highly edge-connected graphs into trees of small diameter
The Tree Decomposition Conjecture by Bárat and Thomassen states that for every tree T there exists a natural number k(T ) such that the following holds: If G is a k(T )-edge-connected simple graph with size divisible by the size of T , then G can be edge-decomposed into subgraphs isomorphic to T . The results on modulo k-orientations by Thomassen show that the Tree Decomposition Conjecture hold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015